Time Constraint M/M/1 Queue

Dally [2] has developed a model to investigate the behavior of virtual channel multiplexing which have been widely employed in the subsequent analytical models of most routing algorithms suggested in the literature. It is indispensable to modify Dally’s model in order to evaluate the performance of channel multiplexing in more general networks where restrictions such as timing constraints of input arrivals and finite buffer size of queues are common. In paper [3], they consider timing constraints of input arrivals to investigate the virtual channel-multiplexing problem inherent in most current networks. The analysis that they propose is completely general and therefore can be used with any interconnect networks employing virtual channels. We have used simulation to see its validity and some result are shown in tables in order to compare the effect of each parameter.